Descendants and Head Normalization of Higher-Order Rewrite Systems
نویسندگان
چکیده
This paper describes an extension of head-needed rewriting on term rewriting systems to higher-order rewrite systems. The main di culty of this extension is caused by the -reductions induced from the higher-order reductions. In order to overcome this di culty, we de ne a new descendant of higher-order rewrite systems. This paper shows the new de nition of descendant, its properties and head normalization of head-needed rewriting on orthogonal higher-order rewrite systems.
منابع مشابه
Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes
The present paper discusses a head-needed strategy and its decidable classes of higher-order rewrite systems (HRSs), which is an extension of the headneeded strategy of term rewriting systems (TRSs). We discuss strong sequential and NV-sequential classes having the following three properties, which are mandatory for practical use: (1) the strategy reducing a head-needed redex is head normalizin...
متن کاملRewrite Systems with Abstraction and β-rule: Types, Approximants and Normalization
In this paper we define and study intersection type assignment systems for first-order rewriting extended with application, λ-abstraction, and β-reduction (TRS+β). One of the main results presented is that, using a suitable notion of approximation of terms, any typeable term of a TRS+β that satisfies a general scheme for recursive definitions has an approximant of the same type. From this resul...
متن کامل(Head-) Normalization of Typeable Rewrite Systems
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable systems. On one hand, for all systems that satisfy a variant of the Jouannaud-Okada Recursion Scheme, every term typeable with a type that is not is head normalizable. On the other hand, non-Curryfied terms that are ...
متن کاملInductive Data Type Systems: Strong Normalization
This paper is concerned with the foundations of Inductive Data Type Systems, an extension of pure type systems by inductive data types. IDTS generalize (inductive) types equipped with primitive recursion of higher-type, by providing de nitions of functions by pattern matching of a form which is general enough to capture recursor de nitions for strictly positive inductive types. IDTS also genera...
متن کاملModularity of Strong Normalization and Confluence in the algebraic-lambda-Cube
elimination des coupures dans l'arithm etique d'ordre sup erieur. 24] Mitsuhiro Okada. Strong normalizability for the combined system of the types lambda calculus and an arbitrary convergent term rewrite system. higher order rules ((rst order rules are simply required to be non-duplicating). Connuence and strong normalization are essential properties of logical systems, since they ensure the co...
متن کامل